The Hilbert Zonotope and a Polynomial Time Algorithm for Universal Grobner Bases
نویسندگان
چکیده
We provide a polynomial time algorithm for computing the universal Gröbner basis of any polynomial ideal having a finite set of common zeros in fixed number of variables. One ingredient of our algorithm is an effective construction of the state polyhedron of any member of the Hilbert scheme Hilbn of n-long d-variate ideals, enabled by introducing the Hilbert zonotope Hn and showing that it simultaneously refines all state polyhedra of ideals on Hilbn . 2003 Elsevier Science (USA). All rights reserved.
منابع مشابه
Global optimization of mixed-integer polynomial programming problems: A new method based on Grobner Bases theory
Mixed-integer polynomial programming (MIPP) problems are one class of mixed-integer nonlinear programming (MINLP) problems where objective function and constraints are restricted to the polynomial functions. Although the MINLP problem is NP-hard, in special cases such as MIPP problems, an efficient algorithm can be extended to solve it. In this research, we propose an algorit...
متن کاملHilbert Series of Group Representations and Grbner Bases for Generic Modules
Each matrix representation P: G —> GLn(K) of a finite Group G over a field K induces an action of G on the module A over the polynomial algebra A = K [ x 1 , . . . , xn]. The graded A-submodule M(P) of A generated by the orbit of (x1, ..., xn) is studied. A decomposition of MO) into generic modules is given. Relations between the numerical invariants of P and those of M(P), the latter being eff...
متن کاملApplying Buchberger's criteria on Montes's DisPGB algorithm
The concept of comprehensive Grobner bases was introduced by Weispfenning. Montes has proposed an efficient algorithm for computing these bases. But he has not explicitly used Buchberger's criteria in his algorithm. In this paper we prove that we can apply these criteria on Montes algorithm. We propose a modified version of Montes algorithm and evaluate its performance via some examples.
متن کاملOn the computation of Hilbert series and Poincare series for algebras with infinite Grobner bases
In this paper we present algorithms to compute finite state automata which, given any rational language, recognize the languages of normal words and n-chains. We also show how these automata can be used to compute the Hilbert series and Poincaré series for any algebra with a rational set of leading words of its minimal Gröbner basis.
متن کاملSystematic encoding via Grobner bases for a class of algebraic-geometric Goppa codes
Any linear code with a nontrivial automorphism has the structure of a module over a polynomial ring. The theory of Griihner bases for modules gives a compact description and implementation of a systematic encoder. We present examples of algebraic-geometric Goppa codes that can be encoded by these methods, including the one-point Hermitian codes. Index TermsSystematic encoding, algebraic-geometr...
متن کامل